A Projection Algorithm for Compressive Sensing
نویسندگان
چکیده
منابع مشابه
Convergence of the Generalized Alternating Projection Algorithm for Compressive Sensing
The convergence of the generalized alternating projection (GAP) algorithm is studied in this paper to solve the compressive sensing problem y = Ax + . By assuming that AA> is invertible, we prove that GAP converges linearly within a certain range of step-size when the sensing matrix A satisfies restricted isometry property (RIP) condition of δ2K , where K is the sparsity of x. The theoretical a...
متن کاملZero-point attracting projection algorithm for sequential compressive sensing
Sequential Compressive Sensing, which may be widely used in sensing devices, is a popular topic of recent research. This paper proposes an online recovery algorithm for sparse approximation of sequential compressive sensing. Several techniques including warm start, fast iteration, and variable step size are adopted in the proposed algorithm to improve its online performance. Finally, numerical ...
متن کاملOptimized Projection Matrix for Compressive Sensing
Compressive sensing (CS) is mainly concerned with low-coherence pairs, since the number of samples needed to recover the signal is proportional to the mutual coherence between projection matrix and sparsifying matrix. Until now, papers on CS always assume the projection matrix to be a random matrix. In this paper, aiming at minimizing the mutual coherence, a method is proposed to optimize the p...
متن کاملA Simple Homotopy Algorithm for Compressive Sensing
In this paper, we consider the problem of recovering the s largest elements of an arbitrary vector from noisy measurements. Inspired by previous work, we develop an homotopy algorithm which solves the l1-regularized least square problem for a sequence of decreasing values of the regularization parameter. Compared to the previous method, our algorithm is more efficient in the sense it only updat...
متن کاملA Compressive-Sensing Inspired Alternate Projection Algorithm for Sparse Array Synthesis
In this paper, we propose a simple approach for sparse array synthesis. We employ a modified generalized alternate projection algorithm using `1-norm constrained minimization in order to achieve the excitation and the position of the elements of a sparse array. The proposed approach is very flexible, since it deals with power pattern masks and allows the inclusion of the effects of element patt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research and Fuzziology
سال: 2015
ISSN: 2163-1476,2163-1530
DOI: 10.12677/orf.2015.51001